منابع مشابه
Sparrow 2011
SPARROW is a stochastic local search (SLS) solver for SAT formulae in CNF format [2]. It was named after the mascot of the German city of Ulm. SPARROW2011 is a variant of SPARROW that was developed for the 2011 SAT competition. The core SPARROW2011 algorithm is identical to SPARROW; it has been re-implemented in UBCSAT [9] and a mechanism has been added to automatically select optimized paramet...
متن کاملAngry Sparrow
Instrumentalists rely on physical gestures such as plunking, bowing, hitting, and blowing air into their instruments in order to produce sound; among tremendous number of human gestures, the body movements employed by musical performers are limited. This compositional project began with the idea of extending the relationship between human gestures and sound by electronic means. From that germin...
متن کاملNot the Nice Sparrow
—We began our studies of House Sparrow (Passer domesticus) biparental care in the mid-1990s by applying the classic Margaret Morse Nice field technique of color-banding individuals. Over the ensuing summers, we slowly accumulated quantitative provisioning records for 100 broods, even as we commenced a series of experimental manipulations. Provisioning data showed parental fitness, as expressed ...
متن کاملGeneralized Cages
Let 2 6 k1 < k2 < · · · < kt, 3 6 g1 < g2 < · · · < gs < N be integer parameters. A (k1, k2, . . . , kt; g1, g2, . . . , gs;N)-graph is a graph that contains vertices of degrees k1, k2, . . . , kt but no other degrees and cycles of lengths g1, g2, . . . , gs but no other cycles of length < N . For any given set of parameters satisfying the above conditions, we present an explicit construction o...
متن کاملConnectivity of cages
A (k; g)-graph is a k-regular graph with girth g. Let f(k; g) be the smallest integer ν such there exists a (k; g)-graph with ν vertices. A (k; g)-cage is a (k; g)-graph with f(k; g) vertices. In this paper we prove that the cages are monotonic in that f(k; g1) < f(k; g2) for all k ≥ 3 and 3 ≤ g1 < g2. We use this to prove that (k; g)-cages are 2-connected, and if k = 3 then their connectivity ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nature
سال: 1871
ISSN: 0028-0836,1476-4687
DOI: 10.1038/004280d0